Constructing internal diagrammatic proofs from external logic diagrams

نویسندگان

  • Yuri Sato
  • Koji Mineshima
  • Ryo Takemura
چکیده

Internal syntactic operations on diagrams play a key role in accounting for efficacy of diagram use in reasoning. However, it is often held that in the case of complex deductive reasoning, diagrams can serve merely as an auxiliary source of information in interpreting sentences or constructing models. Based on experiments comparing subjects’ performances in syllogism solving where logic diagrams of several different forms are used, we argue that internal manipulations of diagrams, or what we call internal constructions of diagrammatic proofs, actually exist, and that such constructions are naturally triggered even for users without explicit prior knowledge of their inference rules or strategies.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Automating Diagrammatic Proofs of Arithmetic Arguments

Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which humans can prove by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is often more clearly perceived in these proofs than in the corresponding algebraic proofs; they capture an intuitive notion of truthfulness that humans find easy to...

متن کامل

Proof Theory for Reasoning with Euler Diagrams: A Logic Translation and Normalization

Proof-theoretical notions and techniques, which are developed based on sentential/symbolic representations of formal proofs, are applied to Euler diagrams. A translation of an Euler diagrammatic system into a natural deduction system is given, and the soundness and faithfulness of the translation are proved. Some consequences of the translation are discussed in view of the notion of free ride, ...

متن کامل

The Logic of Geometric Proof

Logical studies of diagrammatic reasoning—indeed, mathematical reasoning in general—are typically oriented towards proof-theory. The underlying idea is that a reasoning agent computes diagrammatic objects during the execution of a reasoning task. These diagrammatic objects, in turn, are assumed to be very much like sentences. The logician accordingly attempts to specify these diagrams in terms ...

متن کامل

Speedith: A Diagrammatic Reasoner for Spider Diagrams

In this paper, we introduce Speedith which is a diagrammatic theorem prover for the language of spider diagrams. Spider diagrams are a well-known logic for which there is a sound and complete set of inference rules. Speedith provides a way to input diagrams, transform them via the diagrammatic inference rules, and prove diagrammatic theorems. It is designed as a program that plugs into existing...

متن کامل

Diagrammatic Reasoning in Separation Logic

Separation logic is used for reasoning about low-level imperative programs that manipulate pointer data structures. It enables the writing of concise proofs of correctness of the specifications of simple programs, and such proofs have been successfully automated. When reasoning informally about separation logic, it is often useful to draw diagrams representing program states, with memory locati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010